Throughput in Processor-Sharing Queues

Sojourn time asymptotics in processor-sharing queues

Over the past few decades, the Processor-Sharing (PS) discipline has attracted a great deal of attention in the queueing literature. While the PS paradigm emerged in the sixties as an idealization of round-robin scheduling in timeshared computer systems, it has recently captured renewed interest as a useful concept for modeling the flow-level performance of bandwidth-sharing protocols in commun...

Population effects in multiclass processor sharing queues

Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as customers of a different class. The server is operating under the egalitarian or the discriminatory processor sharing discipline. In this paper, we con...

Limited Processor Sharing Queues and Multi-server Queues

Processor-Sharing Queues and Resource Sharing in Wireless LANs

In the past few decades, the processor-sharing (PS) model has received considerable attention in the queueing theory community and in the field of performance evaluation of computer and communication systems. The scarce resource is simultaneously shared among all users in these systems. PS models are used for modeling resource sharing mechanisms and have many applications in communication netwo...

Diffusion Limits of Limited Processor Sharing Queues

We consider a processor sharing queue where the number of jobs served at any time is limited to K, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this measure-valued process is obtained under diffusion scaling and heavy traffic conditions. As a consequence, the limit of the system size process is proved to be a p...